Outermost-Fair Rewriting
نویسنده
چکیده
A rewrite sequence is said to be outermost-fair if every out-ermost redex occurrence is eventually eliminated. O'Donnell has shown that outermost-fair rewriting is normalising for almost orthogonal rst-order term rewriting systems. In this paper we extend this result to the higher-order case.
منابع مشابه
Normalisation in Weakly Orthogonal Rewriting
A rewrite sequence is said to be outermost-fair if every outer-most redex occurrence is eventually eliminated. Outermost-fair rewriting is known to be (head-)normalising for almost orthogonal rewrite systems. In this paper we study (head-)normalisation for the larger class of weakly orthogonal rewrite systems. Normalisation is established and a counterexample against head-normalisation is provi...
متن کاملInfinitary Combinatory Reduction Systems: Normalising Reduction Strategies
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in first-order infinitary rewriting and provide the first examples of normalising strategies for infin...
متن کاملA Sequential Reduction Strategy
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present a computable sequential reduction strategy similar in scope, but simpler and more general. Our strategy can be thought of as an outermost-fair-like strategy that is allowed to be unfair to some redex of a term when con...
متن کاملFrom Outermost to Context-Sensitive Rewriting
We define a transformation from term rewriting systems (TRSs) to context-sensitive TRSs in such a way that termination of the target system implies outermost termination of the original system. For the class of left-linear TRSs the transformation is complete. Thereby state-of-the-art termination methods and automated termination provers for context-sensitive rewriting become available for provi...
متن کاملReduction Strategies and Acyclicity
In this paper we review some well-known theory about reduction strategies of various kinds: normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the definition of such strategies is the presence of reduction cycles that may ‘trap’ a strategy as it is memory-free. We exploit a recently (re)discovered fact that there are no reduction cycles in orthogonal rewrite systems when ...
متن کامل